(SEL) A
declarative language for set processing by Bharat
Jayaraman with subset and equational program clauses;
patternmatching over sets (it supports efficient iteration over
sets); annotations to say which functions distribute over
union in which arguments (for point-wise/incremental
circular constraints (implemented by mixed
modest user-interface including tracing.
WAM-like code, extended to deal with set-matching,
["Towards a Broader Basis for Logic Programming",
B. Jayaraman, TR CS Dept, SUNY Buffalo, 1990].
["Set Abstraction in Functional and Logic Programming",
(1994-12-15)